The Application of Model-checking to Veriication Problems in Telephone Switching Systems
نویسنده
چکیده
Model-checking is becoming very popular for automated reasoning about hardware and software. The input can be in any language provided there is a translation to transition systems or Kripke structures; properties are then expressed in a temporal logic. Telephone switching systems are concurrent systems which are naturally described by a composition of interacting nite automata. We describe a model of one switching system in IO-Automata, express it in Promela (process meta language) and then formulate certain properties in LTL (linear temporal logic). Using the model-checker Spin, we have attempted to verify the model with respect to some properties. A particular challenge is that even a simple switching system leads to state space explosion.
منابع مشابه
Modelling a Telephone Switching System for Veriication
After identifying the general structure of a POTS (Plain Old Telephone System) Switching System we model individual components as communicating-nite state machines. Formulating the nite state machines in Promela (Process Meta Language) allows us to verify general and speciic properties of the model using the model-checker Spin. Modelling operational systems imposes design decisions, which we wi...
متن کاملBeyond Regular Model Checking
In recent years, it has been established that regular model checking can be successfully applied to several parameterized veriication problems. However, there are many parameterized veriication problems that cannot be described by regular languages, and thus cannot be veri-ed using regular model checking. In this study we try to practice symbolic model checking using classes of languages more e...
متن کاملVeriication of Innnite State Systems by Compositional Model Checking
Compositional model checking methods can be used to reduce the formal veriication of a complex system to model checking problems of tractably small size. However, such techniques are diicult to apply to systems that have large data types, such as memory addresses, or large data arrays such as memories or FIFO buuers. They are also limited to the veriication of systems with xed nite resources. I...
متن کاملReachability checking in complex and concurrent software systems using intelligent search methods
Software system verification is an efficient technique for ensuring the correctness of a software product, especially in safety-critical systems in which a small bug may have disastrous consequences. The goal of software verification is to ensure that the product fulfills the requirements. Studies show that the cost of finding and fixing errors in design time is less than finding and fixing the...
متن کاملAn Efficient High-Step-Up Soft-Switching Boost Converter for Photovoltaic Application
In this paper an efficient high step-up converter with a coupled- inductor with soft- switching operation is presented. The proposed topology includes a coupled-inductor boost converter for raising the voltage gain. Moreover, a simple auxiliary resonant circuit composed of an auxiliary switch, a clamping diode and a resonant tank (inductor, capacitor), is adopted in this paper. The coupled-indu...
متن کامل